TOWARDS A FORMAL TIE BETWEEN COMBINATORIAL AND CLASSICAL VECTOR FIELD DYNAMICS By
نویسندگان
چکیده
Forman’s combinatorial vector fields on simplicial complexes are a discrete analogue of classical flows generated by dynamical systems. Over the last decade, many notions from dynamical systems theory have found analogues in this combinatorial setting, such as for example discrete gradient flows and Forman’s discrete Morse theory. So far, however, there is no formal tie between the two theories, and it is not immediately clear what the precise relation between the combinatorial and the classical setting is. The goal of the present paper is to establish such a formal tie on the level of the induced dynamics. Following Forman’s paper [5], we work with possibly non-gradient combinatorial vector fields on finite simplicial complexes, and construct a flow-like upper semicontinuous acyclic-valued mapping on the underlying topological space whose dynamics is equivalent to the dynamics of Forman’s combinatorial vector field on the level of isolated invariant sets and isolating blocks.
منابع مشابه
Persistent Homology of Morse Decompositions in Combinatorial Dynamics
We investigate combinatorial dynamical systems on simplicial complexes considered as finite topological spaces. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics directly from the sample. We study the homological persistence of Morse decompositions of such systems, an important descriptor of the dynamics, as a tool for valida...
متن کاملQuantum emulation of classical dynamics
In statistical mechanics, it is well known that finite-state classical lattice models can be recast as quantum models, with distinct classical configurations identified with orthogonal basis states. This mapping makes classical statistical mechanics on a lattice a special case of quantum statistical mechanics, and classical combinatorial entropy a special case of quantum entropy. In a similar m...
متن کاملFormal Methods for Mining Structured Objects
In the field of knowledge discovery, graphs of concepts are an expressive and versatile modeling technique that provides ways to reason about information implicit in a set of data. Interesting examples of this can be found under the classical mathematical theory of Formal Concept Analysis, dedicated to construct a lattice of concepts by defining a Galois connection on a binary relationship. Her...
متن کاملDifferential Geometry via Infinitesimal Displacements
We present a new formulation of some basic differential geometric notions on a smooth manifold M , in the setting of nonstandard analysis. In place of classical vector fields, for which one needs to construct the tangent bundle of M , we define a prevector field, which is an internal map from ∗M to itself, implementing the intuitive notion of vectors as infinitesimal displacements. We introduce...
متن کاملFine Costs for the Euclid Algorithm on Polynomials and Farey Maps
This paper studies digit-cost functions for the Euclid algorithm on polynomials with coefficients in a finite field, in terms of the number of operations performed on the finite field Fq . The usual bit-complexity is defined with respect to the degree of the quotients; we focus here on a notion of ‘fine’ complexity (and on associated costs) which relies on the number of their non-zero coefficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014